A multi - objective possibilistic programming approach for locating distribution centers and allocating customers demands in supply chains
نویسندگان
چکیده
Article history: Received 1 January 2010 Received in revised form 5 May 2010 Accepted 18 May 2010 Available online 18 May 2010 In this paper, we present a multi-objective possibilistic programming model to locate distribution centers (DCs) and allocate customers' demands in a supply chain network design (SCND) problem. The SCND problem deals with determining locations of facilities (DCs and/or plants), and also shipment quantities between each two consecutive tier of the supply chain. The primary objective of this study is to consider different risk factors which are involved in both locating DCs and shipping products as an objective function. The risk consists of various components: the risks related to each potential DC location, the risk associated with each arc connecting a plant to a DC and the risk of shipment from a DC to a customer. The proposed method of this paper considers the risk phenomenon in fuzzy forms to handle the uncertainties inherent in these factors. A possibilistic programming approach is proposed to solve the resulted multi-objective problem and a numerical example for three levels of possibility is conducted to analyze the model. © 2010 Growing Science Ltd. All rights reserved.
منابع مشابه
An Interactive Possibilistic Programming Approach to Designing a 3PL Supply Chain Network Under Uncertainty
The design of closed-loop supply chain networks has attracted increasing attention in recent decades with environmental concerns and commercial factors. Due to the rapid growth of knowledge and technology, the complexity of the supply chain operations is increasing daily and organizations are faced with numerous challenges and risks in their management. Most organizations with limited resources...
متن کاملA Three-Echelon Multi-Objective Multi-Period Multi-Product Supply Chain Network Design Problem: A Goal Programming Approach
In this paper, a multi-objective multi-period multi-product supply chain network design problem is introduced. This problem is modeled using a multi-objective mixed integer mathematical programming. The objectives are maximizing the total profit of logistics, maximizing service level, and minimizing inconsistency of operations. Several sets of constraints are considered to handle the real situa...
متن کاملA possibilistic bi-objective model for a competitive supply chain network design under variable coverage
In this paper, the strategic planning of a supply chain under a static chain-to-chain competition on the plane is addressed. It is assumed that each retailer has a coverage area called the radius of influence. The demand of each demand zone is divided equally between the retailers which can cover that market. However, the demand of distant customers who are not in the retailers’ radius of influ...
متن کاملAn Inventory Routing Problem for Perishable Products with Stochastic Demands and Direct Deliveries
In any supply chain, distribution planning of products is of great importance to managers. With effective and flexible distribution planning, mangers can increase the efficiency of time, place, and delivery utility of whole supply chain. In this paper, inventory routing problem (IRP) is applied to distribution planning of perishable products in a supply chain. The studied supply chain is compos...
متن کاملCapacitated Facility Location Problem with Variable Coverage Radius in Distribution System
The problem of locating distribution centers (DCs) is one of the most important issues in design of supply chain. In previous researches on this problem, each DC could supply products for all of the customers. But in many real word problems, DCs can only supply products for customers who are in a certain distance from the facility, coverage radius. Thus, in this paper a multi-objective intege...
متن کامل